A Post's Program for Complexity Theory

On the Development of Emil Post's Ideas in Structural Complexity Theory

Structural complexity theory is one of the branches of computer science. In this survey we will show how notions of a complete r.e. set and many-one reducibility from Post's 1944 paper innuenced the study of NP-complete languages in structural complexity theory.

Separating Complexity Classes Using Autoreducibility

A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that ...

Using Autoreducibility to Separate Complexity Classes

A language is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate exponential space from doubly exponential space by showing that all Turing-complete sets for exponential space are autoreducible but there exists some Turing-complete set for doubly exponential space that is not. We immediately also ge...

On the Relative Complexity of Post's Classes

Complexity of logic-based argumentation in Post's framework

Complexity of logic-based argumentation in Post's framework Nadia Creignou a , Johannes Schmidt a , Michael Thomas b & Stefan Woltran c a LIF, UMR CNRS 6166, Aix-Marseille Université, 163 Avenue de Luminy, 13288, Marseille Cedex 9, France b TWT GmbH, Bernhäuser Straße 40–42, 73765, Neuhausen a.d.F., Germany c Institut für Informationssysteme E184/2, Technische Universität Wien, Favoritenstr. 9–...